Random veering triangulations are not geometric
نویسندگان
چکیده
منابع مشابه
Taut branched surfaces from veering triangulations
Let M be a closed hyperbolic 3-manifold with a fibered face σ of the unit ball of the Thurston norm on H2(M). If M satisfies a certain condition related to Agol’s veering triangulations, we construct a taut branched surface in M spanning σ. This partially answers a 1985 question of Oertel, and extends an earlier partial answer due to Mosher.
متن کاملConstruction of non-geometric veering triangulations of fibered hyperbolic 3-manifolds
Acknowledgements Firstly, I'd like to express my gratitude to Craig; I feel privileged to have had such an excellent supervisor who was generous with his time and ideas, and who helped me grow throughout the course of this project. I'd also like to thank Henry Segerman who contributed substantially to this thesis in various forms, in particular for the many fruitful discussions and for answerin...
متن کاملRandom walks veering left ∗
We study coupled random walks in the plane such that, at each step, the walks change direction by a uniform random angle plus an extra deterministic angle θ. We compute the Hausdorff dimension of the θ for which the walk has an unusual behavior. This model is related to a study of the spectral measure of some random matrices. The same techniques allow to study the boundary behavior of some Gaus...
متن کاملFibered Faces, Veering Triangulations, and the Arc Complex
We study the connections between subsurface projections in curve and arc complexes in fibered 3-manifolds and Agol’s veering triangulation. The main theme is that large-distance subsurfaces in fibers are associated to large simplicial regions in the veering triangulation, and this correspondence holds uniformly for all fibers in a given fibered face of the Thurston norm.
متن کاملConvex Polygons in Geometric Triangulations
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(1.5029). This improves an earlier bound of O(1.6181) established by van Kreveld, Löffler, and Pach (2012) and almost matches the current best lower bound of Ω(1.5028) due to the same authors. Given a planar straight-line graph G with n vertices, we also show how to compute efficiently the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2020
ISSN: 1661-7207
DOI: 10.4171/ggd/575